On sequential selection and a first passage problem for the Poisson process

This note is motivated by connections between the online and offline problems of selecting a possibly long subsequence from Poisson-paced sequence uniform marks under either monotonicity or sum constraint. The problem with constraint amounts to counting Poisson arrivals before their total exceeds certain level. A precise asymptotics for mean count obtained coupling nonlinear pure birth process.